Data flow classification device

ABSTRACT

Disclosed is a data flow classification device including a forwarding circuit and a configuring circuit. The forwarding circuit looks the classification of an input flow up in a lookup table according to the information of the input flow, tags the packets of the input flow with the classification, and outputs the packets to a buffer circuit. The configuring circuit receives and stores the identification and traffic information of multiple flows, and accordingly calculates the traffic of the multiple flows, wherein the multiple flows include the input flow. The configuring circuit further determines an elephant flow threshold according to a queue length of the buffer circuit and a target length, determines the classifications of the multiple flows according to the comparison between the traffic of the multiple flows and the elephant flow threshold, and stores these classifications in the lookup table.

BACKGROUND OF THE INVENTION 1. Field of the Invention

The present disclosure relates to a classification device, especially toa data flow classification device.

2. Description of Related Art

Bufferbloat means that a forwarding device (e.g., a network switch)excessively buffers packets and thereby causes the occurrence of highlatency and delay variation in a network. Bufferbloat is usually tackledwith the following three manners:

-   (1) Queue scheduling under class of service (CoS): This manner    classifies packets, associates different classifications of the    packets with different queues, and then assigns different classes of    service to the different queues according to a scheduling algorithm.-   (2) Active queue management (AQM): This manner does not classify    packets, but discards a part of the packets according to a    probability before a queue is full of the packets so that an average    queue length of the queue can be reduced.-   (3) Weighted AQM: This manner classifies packets and assigns    different packet discard rates to different classifications of the    packets so as to preferentially discard packets of low transmission    priority and reserve buffer space for packets of high transmission    priority.

However, it is difficult to properly classify packets. The most commonmanner is to classify packets according to user setting; however, thismanner is not convenient to users and hard to classify packets properly.The aforementioned AQM manner can reduce the average queuing delay;however, since this manner does not classify packets, packets of hightransmission priority and packets of low transmission priority will bediscarded by the same probability, and this affects the throughput ofthe packets of high transmission priority (e.g., Voice over InternetProtocol (VoIP) packets, realtime video stream packets, gaming packets)and user experience.

SUMMARY OF THE INVENTION

An object of the present disclosure is to provide a data flowclassification device capable of preventing the problems of the priorart.

An embodiment of the data flow classification device of the presentdisclosure includes a forwarding circuit and a configuring circuit. Eachof the forwarding circuit and the configuring circuit can be realizedwith hardware or realized with hardware executing software and/orfirmware.

The forwarding circuit includes a first storage circuit, aclassification circuit, and a data flow information acquiring circuit.The first storage circuit is configured to store a lookup table whichstores the identification information of multiple data flows and theclassifications of the multiple data flows. The classification circuitis coupled with a data flow input and the first storage circuit, andconfigured to receive a first data flow from the data flow input andsearch the identification information of the multiple data flows in thelookup table for the first identification information of the first dataflow. On condition that the first identification information is includedin the lookup table, the classification circuit determines theclassification of the first data flow according to the classificationsof the multiple data flows included in the lookup table and outputs thefirst data flow to a buffer circuit. On condition that the firstidentification information is not included in the lookup table, theclassification circuit treats the classification of the first data flowas a predetermined classification and outputs the first data flow to thebuffer circuit. The data flow information acquiring circuit isconfigured to acquire at least a part of the first data flow to obtainand output the first identification information and the first trafficinformation of the first data flow.

The configuring circuit includes a second storage circuit, anelephant-flow traffic threshold adjustment circuit, and a classificationdecision circuit. The second storage circuit is coupled to the data flowinformation acquiring circuit, and configured to store a data flowinformation table which stores the identification information of themultiple data flows and the traffic information of the multiple dataflows, in which the identification information of the multiple dataflows includes the first identification information and the trafficinformation of the multiple data flows includes the first trafficinformation. The elephant-flow traffic threshold adjustment circuit iscoupled to the buffer circuit, and configured to determine anelephant-flow traffic threshold according to the variation in a relationbetween a target queue state (e.g., target queue length or targetqueuing delay) and a current queue state (e.g., current queue length orcurrent queuing delay) of the buffer circuit. The classificationdecision circuit is coupled to the elephant-flow traffic thresholdadjustment circuit, the second storage circuit, and the first storagecircuit, and configured to determine the classifications of the multipledata flows stored in the lookup table of the first storage circuitaccording to the variation in a relation between the traffic informationof the multiple data flows and the elephant-flow traffic threshold.

In light of the above, the embodiment classifies more/fewer data flowsunder an elephant flow classification by the control of theelephant-flow traffic threshold, so that the buffer circuit can preventbufferbloat in a manner of lowering the transmission priority of anelephant flow or preferentially discarding packets of the elephant flow.

These and other objectives of the present invention will no doubt becomeobvious to those of ordinary skill in the art after reading thefollowing detailed description of the preferred embodiments that areillustrated in the various figures and drawings.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 shows an embodiment of the data flow classification device of thepresent disclosure.

FIG. 2 shows an embodiment of the forwarding circuit of FIG. 1.

FIG. 3 shows an embodiment of the configuring circuit of FIG. 1.

FIG. 4 shows an embodiment of how the elephant-flow traffic thresholdadjustment circuit of FIG. 3 determines the state of the buffer circuit.

FIG. 5 shows another embodiment of how the elephant-flow trafficthreshold adjustment circuit of FIG. 3 determines the state of thebuffer circuit.

FIG. 6 shows an embodiment of how the elephant-flow traffic thresholdadjustment circuit of FIG. 3 adjusts the elephant-flow trafficthreshold.

FIG. 7 shows an exemplary implementation of how the classificationdecision circuit of FIG. 3 determines the classification of the firstdata flow.

FIG. 8 shows another exemplary implementation of how the classificationdecision circuit of FIG. 3 determines the classification of the firstdata flow.

FIG. 9 shows yet another exemplary implementation of how theclassification decision circuit of FIG. 3 determines the classificationof the first data flow.

FIG. 10 shows another embodiment of the data flow classification deviceof the present disclosure.

FIG. 11 shows an embodiment of the forwarding circuit of FIG. 10.

FIG. 12 shows an embodiment of the configuring circuit of FIG. 10.

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

The present specification discloses a data flow classification devicecapable of classifying multiple data flows according to the comparisonbetween the traffic of the multiple data flows and an elephant-flowtraffic threshold. When a queue state (e.g., queue length or queuingdelay) of a back-end buffer circuit is longer (or shorter) than a targetthreshold, the data flow classification device of the present disclosurecan lower (or raise) the elephant-flow traffic threshold correspondinglyso as to classify more (or fewer) data flows under an elephant flowclassification, which allows the back-end buffer circuit to preventbufferbloat in a manner of lowering the transmission priority of anelephant flow or preferentially discarding packets of the elephant flow.The data flow classification device is applicable to a network packetforwarding device (e.g., a network switch); in such applications, dataflows are composed of continuous packets and/or discontinuous packets.For better understanding, the following description is based on anetwork packet forwarding application, but the application of thepresent invention is not limited thereto.

FIG. 1 shows an embodiment of the data flow classification device of thepresent disclosure. The data flow classification device 100 of FIG. 1includes a forwarding circuit 110 and a configuring circuit 120. Theforwarding circuit 110 is configured to receive and classify a data flowand then forward the classified data flow to a buffer circuit 10. Theforwarding circuit 110 is further configured to provide the trafficinformation of the data flow for the configuring circuit 120. Theconfiguring circuit 120 is configured to determine the classification ofthe data flow according to the queue information of the buffer circuit10 and the traffic information of the data flow, and then provide theclassification of the data flow for the forwarding circuit 110. Each ofthe forwarding circuit 110 and the configuring circuit 120 can berealized with hardware or realized with hardware executing softwareand/or firmware.

FIG. 2 shows an embodiment of the forwarding circuit 110 of FIG. 1. Theforwarding circuit 110 of FIG. 2 includes a recording circuit 210, aclassification circuit 220, and a data flow information supplementcircuit 230. The recording circuit 210 and the classification circuit220 can optionally be integrated into one circuit (e.g., a lookup tablecircuit), but the implementation of the present invention is not limitedthereto.

Referring to FIGS. 1-2. The recording circuit 210 is configured tocalculate the traffic of each of the multiple data flows and therebyobtain the traffic information of the multiple data flows. For example,the recording circuit 210 determines the identification of a data flowaccording to the identification information of the data flow, and thencalculates the packet number and/or the byte number of the data flow toobtain the traffic information of the data flow. The recording circuit210 further includes a lookup table 212, wherein the term “include” herecan be interpreted as “store”. The lookup table 212 includes theidentification information of the multiple data flows, the trafficinformation of the multiple data flows, and the classifications of themultiple data flows, wherein the term “include” here can be interpretedas “store”. In an exemplary implementation, the identificationinformation of each of the multiple data flows is a set of values. Forexample, the set of values is a 5-tuple including a destination InternetProtocol (IP) address, a source IP address, a protocol, a destinationport, and a source port, but the implementation of the present inventionis not limited thereto. Providing an implementation of the presentinvention is practicable, any information that can be used as theidentification of a data flow can be the identification information inthis implementation. Since the calculation of the aforementioned packetnumber/byte number and the implementation of the aforementioned lookuptable can be realized with known or self-developed technologies, theirdetails are omitted here.

Referring to FIGS. 1-2. The classification circuit 220 is coupled to adata flow input (i.e., the source of the arrow labeled with “data flows”in the figures) and the recording circuit 210, and configured to receivea first data flow from the data flow input and then search theidentification information of the multiple data flows in the lookuptable 212 for the first identification information of the first dataflow, wherein the term “first” here is for description conveniencerather than implementation limitation and thus the first data flow canbe any data flow from the data flow input. When the lookup table 212includes the first identification information, the lookup table 212logically includes the classification of the first data flow related tothe first identification information; accordingly, the classificationcircuit 220 can determine the classification of the first data flow withthe lookup table 212 and then output the classified first data flow tothe buffer circuit 10. When the lookup table 212 does not include thefirst identification information, the classification circuit 220classifies the first data flow under a predetermined classification andthen outputs the classified first data flow to the buffer circuit 10. Itis noted that when the lookup table 212 does not include the firstidentification information, the classification circuit 220 may make thedata flow information supplement circuit 230 to acquire at least a partof the first data flow from the output of the classification circuit 220(e.g., the arrow labeled with “classified data flow” in the figures) orfrom the data flow input by means of sending a notification signal tothe classification circuit 220 or other known/self-developed manners(e.g., the control of one or more switch(es) for passing/blocking thetransmission of the at least a part of the first data flow); therefore,the data flow information supplement circuit 230 can optionally updatethe lookup table 212 according to the at least a part of the first dataflow. It is also noted that the buffer circuit 10 of FIG. 1 can beintegrated into the data flow classification device 100 or independentof the data flow classification device 100.

In an exemplary implementation, the classifications of the multiple dataflows stored in the lookup table 212 include an elephant flowclassification and a non-elephant flow (e.g., a mouse flow)classification. Normally, the traffic of any data flow classified underthe elephant flow classification is higher than the traffic of any dataflow classified under the non-elephant flow classification. In regard tothe operation of the buffer circuit 10, an elephant flow transmissionpriority assigned to the elephant flow classification is lower than anon-elephant flow transmission priority assigned to the non-elephantflow classification, or an elephant flow packet discard rate inconnection with the elephant flow classification is higher than anon-elephant flow packet discard rate in connection with thenon-elephant flow classification; and the aforementioned predeterminedclassification is the non-elephant flow classification. In an exemplaryimplementation, the elephant flow classification includes a firstclassification and a second classification; the traffic of any data flowclassified under the first classification is higher than the traffic ofany data flow classified under the second classification; and in regardto the operation of the buffer circuit 10, a first transmission priorityassigned to the first classification is lower than a second transmissionpriority assigned to the second classification, or a first packetdiscard rate in connection with the first classification is higher thana second packet discard rate in connection with the secondclassification. The elephant flow classification may include moresub-classifications according to the demand for implementation.

In an exemplary implementation, each packet of the first data flowincludes the first identification information. The classificationcircuit 220 is configured to search the identification information ofthe multiple data flows stored in the lookup table 212 for the firstidentification information. When the lookup table 212 already stores thefirst identification information, the lookup table 212 logically storesthe classification of the first data flow; accordingly, theclassification circuit 220 can tag each packet of the first data flowwith the classification of the first data flow stored in the lookuptable, and then the buffer circuit 10 can ascertain the classificationof a packet (i.e., the elephant flow classification or the non-elephantflow classification) according to its tag. In an exemplaryimplementation, the classification circuit 220 tags a packet with itsclassification by means of determining the value of a metadata (e.g.,color-narrative metadata) of each packet of the first data flow. Sincetagging a packet can be realized with a known/self-developed technology,the details are omitted here.

Referring to FIGS. 1-2. The data flow information supplement circuit 230is coupled with the recording circuit 210 and the classification circuit220. When the lookup table 212 does not include the first identificationinformation, the data flow information supplement circuit 230 acquiresat least a part of the first data flow from the output of theclassification circuit 220 or from the data flow input so as to obtainthe first identification information of the first data flow; afterward,the data flow information supplement circuit 230 adds the firstidentification information to the lookup table 212 as a part of theidentification information of the multiple data flows. In addition, therecording circuit 210 calculates the traffic of the first data flow toobtain the first traffic information of the first data flow and adds itto the lookup table 212 as a part of the traffic information of themultiple data flows. If the lookup table 212 is full before the additionof the first identification information and the first trafficinformation, the data flow information supplement circuit 230 can removethe information of a data flow (e.g., the data flow determined accordingto a Least Recently Used (LRU) algorithm) stored in the lookup table212, but the implementation of the present invention is not limitedthereto. In an exemplary implementation, in consideration of the limitedsize of the lookup table 212, the data flow information supplementcircuit 230 performs a sample operation according to a predeterminedprobability (e.g., P %, wherein P is a number between 0 and 100);accordingly, a probability of the data flow information supplementcircuit 230 acquiring the at least a part of the first data flow isequal to the predetermined probability, which implies that the data flowinformation supplement circuit 230 does not sample every data flow andrecord its identification and traffic information. Since the sampleoperation and the operation of acquiring specific information of apacket can be realized with known/self-developed technologies, theirdetails are omitted here.

FIG. 3 shows an embodiment of the configuring circuit 120 of FIG. 1. Theconfiguring circuit 120 of FIG. 3 includes an elephant-flow thresholdadjustment circuit 310 and a classification decision circuit 320.

Referring to FIGS. 1-3. The elephant-flow traffic threshold adjustmentcircuit 310 is coupled to the buffer circuit 10 and configured todetermine an elephant-flow traffic threshold (ELE_TH) according to thevariation in a relation between a target queue state (e.g., constantqueue length or constant queuing delay) and a current queue state of thebuffer circuit 10 (e.g., variable queue length or variable queuingdelay); in other words, the elephant-flow traffic threshold may varywith the current queue state. In an exemplary implementation, after thecurrent queue state (Curr_QL) is superior to the target queue state(Target_QL) N time(s), the elephant-flow traffic threshold adjustmentcircuit 310 determines that the buffer circuit 10 changes from anon-congestion state to a congestion state as illustrated with FIGS.4-5, and the elephant-flow traffic threshold adjustment circuit 310lowers the elephant-flow traffic threshold at least one time so as tofind out more data flows that could be elephant flows; accordingly, thebuffer circuit 10 can discard at least a part of the elephant flow(s) torelieve the congestion. The term “be superior to” in this specificationcan be interpretated as “exceed” or “be worse than”, and theabove-mentioned “N” is a positive integer (e.g., an integer greater thanone).

In an exemplary implementation, packets classified under differentclassifications are allocated to the same queue of the buffer circuit10, and the buffer circuit 10 can adopt a known/self-developed weightedactive queue management (Weighted AQM) technology to discard the packetsin the queue by a probability. In a circumstance that the buffer circuit10 is in the congestion state, after the current queue state is inferiorto one-K^(th) of the target queue state M time(s), the elephant-flowtraffic threshold adjustment circuit 310 determines that the buffercircuit 10 returns to the non-congestion state (as shown in FIG. 4) andthen raises the elephant-flow traffic threshold at least one time, so asto reduce a probability of a data flow being classified under theelephant flow classification. The term “be inferior to” in thisspecification can be interpreted as “do not exceed” or “be better than”,and both the above-mentioned “K” and “M” are positive integers (e.g.,integers greater than one) determined according to the demand forimplementation.

In an exemplary implementation, packets classified under differentclassifications are allocated to different queues of the buffer circuit10, and the buffer circuit 10 can adopt a known/self-developed Class ofService (CoS) queue scheduling technology to assign different classes ofservice to different queues respectively. The buffer circuit 10 includesa non-elephant flow buffer queue and at least one elephant flow bufferqueue (e.g., a first elephant flow buffer queue and a second elephantflow buffer queue, wherein the first elephant buffer queue has a lowertransmission priority or a higher packet discard rate in comparison withthe second elephant flow buffer queue); the current queue state is acurrent queue state of the non-elephant flow buffer queue (e.g.,CurrG_QL of FIG. 5); a non-elephant flow transmission priority assignedto the non-elephant flow buffer queue is higher than any elephant flowtransmission priority assigned to the at least one elephant flow bufferqueue, or a non-elephant flow packet discard rate in connection with thenon-elephant flow buffer queue is lower than any elephant flow packetdiscard rate in connection with the at least one elephant flow bufferqueue. In a circumstance that the buffer circuit 10 is in a congestionstate, after each current queue state of the at least one elephant flowbuffer queue (e.g., CurrY_QL and CurrR_QL in FIG. 5) is inferior toone-K^(th) of the target queue state M time(s), the elephant-flowtraffic threshold adjustment circuit 310 determines that the buffercircuit 310 returns to a non-congestion state and then raises theelephant-flow traffic threshold at least one time, so as to reduce aprobability of a data flow being classified under the elephant flowclassification. Both the above-mentioned “K” and “M” are positiveintegers (e.g., integers greater than one) determined according to thedemand for implementation. It is noted that the setting of the “Ntime(s)”, “M time(s)”, and “one-K^(th)” in the embodiments of thisspecification is used to control the sensitivity of the elephant-flowtraffic threshold adjustment circuit 310 to thecongestion/non-congestion state of the buffer circuit 10, and canprevent the state of the buffer circuit 10 from changing frequently; inbrief, the setting can be determined according to the demand forimplementation flexibly.

FIG. 6 is a flow chart showing an embodiment of how the elephant-flowtraffic threshold adjustment circuit 310 adjusts the elephant-flowtraffic threshold (ELE_TH). The steps of FIG. 6 are described below, andcan be repeated according to the demand for implementation.

-   S610: The elephant-flow traffic threshold adjustment circuit 310    determines that the buffer circuit 10 is in a congestion state.-   S620: The elephant-flow traffic threshold adjustment circuit 310    determines whether the current queue state (Curr_QL) is superior to    the target queue state (Target_QL); if the result is YES, the    elephant-flow traffic threshold adjustment circuit 310 performs step    S632; and if the result is NO, the elephant-flow traffic threshold    adjustment circuit 310 performs step S634.-   S632: The elephant-flow traffic threshold adjustment circuit 310    determines that the congestion state is not relieved and therefore    performs step S642.-   S634: The elephant-flow traffic threshold adjustment circuit 310    determines that the congestion state is relieved and therefore    performs step S644.-   S642: The elephant-flow traffic threshold adjustment circuit 310    determines whether the current queue state (Curr_QL) is superior to    a previous queue state (Old_QL); if the result is YES, the    elephant-flow traffic threshold adjustment circuit 310 performs step    S652; if the result is NO, the elephant-flow traffic threshold    adjustment circuit 310 performs step S654. In this step, a queue    state (e.g., queue length or queuing delay) of the buffer circuit 10    at a current time point is the current queue state, and the queue    state of the buffer circuit 10 at a previous time point is the    previous queue state.-   S644: The elephant-flow traffic threshold adjustment circuit 310    determines whether the current queue state (Curr_QL) is superior to    a previous queue state (Old_QL); if the result is YES, the    elephant-flow traffic threshold adjustment circuit 310 performs step    S654; if the result is NO, the elephant-flow traffic threshold    adjustment circuit 310 performs step S656. In this step, a queue    state (e.g., queue length or queuing delay) of the buffer circuit 10    at a current time point is the current queue state, and the queue    state of the buffer circuit 10 at a previous time point is the    previous queue state.-   S652: The elephant-flow traffic threshold adjustment circuit 310    determines that the congestion state gets worse, and therefore    performs step S662.-   S654: The elephant-flow traffic threshold adjustment circuit 310    determines that the congestion state varies insignificantly, and    therefore performs step S664.-   S656: The elephant-flow traffic threshold adjustment circuit 310    keeps the elephant-flow traffic threshold unchanged.-   S662: The elephant-flow traffic threshold adjustment circuit 310    lowers the elephant-flow traffic threshold by an adjustment value.    For example, since step S662 is on the premise that the congestion    state gets worse (i.e., step S652) and step S664 is on the premise    that the congestion state varies insignificantly (i.e., step S654),    the adjustment value applied in step S662 can be greater than the    adjustment value applied in step S664.-   S664: The elephant-flow traffic threshold adjustment circuit 310    lowers the elephant-flow traffic threshold by an adjustment value.

In an exemplary implementation, the adjustment values (Rate_adj)mentioned in the steps S662 and S664 of FIG. 6 can be determinedaccording to the following equation:

Rate_adj=A×(Curr_QL−Target_QL)+B×(Curr_QL−Old_QL)

In the above equation, the “A” and “B” are constants determinedaccording to the demand for implementation, and used for increasing ordecreasing the degree of the adjustment in the elephant-flow trafficthreshold (ELE_TH) (e.g., ELE_TH=ELE_TH−Rate_adj, wherein ELE_TH is notlower than zero); if both the “A” and “B” are zero, the elephant-flowtraffic threshold is kept unchanged. In addition, the adjustment valuescan vary with the level of the elephant-flow traffic threshold asillustrated with Table 1 below, but the implementation of the presentinvention is not limited thereto.

TABLE 1 ELE_TH Rate_adj ELE_TH < 1 Mbps Rate_adj = Rate_adj/128 ELE_TH <2 Mbps Rate_adj = Rate_adj/64 ELE_TH < 4 Mbps Rate_adj = Rate_adj/32ELE_TH < 8 Mbps Rate_adj = Rate_adj/16 ELE_TH < 16 Mbps Rate_adj =Rate_adj/8 ELE_TH < 32 Mbps Rate_adj = Rate_adj/4 ELE_TH < 64 MbpsRate_adj = Rate_adj/2 ELE_TH ≥ 64 Mbps Rate_adj = Rate_adj

As mentioned in the preceding paragraph, after the elephant-flow trafficthreshold adjustment circuit 310 determines that the buffer circuit 10returns to the non-congestion state (as shown in FIGS. 4-5), theelephant-flow traffic threshold adjustment circuit 310 raises theelephant-flow traffic threshold. In an exemplary implementation, theelephant-flow traffic threshold is limited to an upper limit; when theelephant-flow traffic threshold fails to reach the upper limit, theelephant-flow traffic threshold (ELE_TH) can be raised according to thefollowing equation:

${ELE\_ TH} = {{ELE\_ TH} \times \left( {1 + \frac{1}{64}} \right)}$

The above equation is just an example, and those having ordinary skillin the art can modify this equation according to their demand forimplementation.

Referring FIGS. 1-3. The classification decision circuit 320 is coupledto the elephant-flow traffic threshold adjustment circuit 310 and therecording circuit 210. The classification decision circuit 320 obtainsthe traffic information of the multiple data flows from the recordingcircuit 210, and is configured to determine the classifications of themultiple data flows according to the variation in a relation between thetraffic information of the multiple data flows and the elephant-flowtraffic threshold; in other words, the classifications of the multipledata flows may vary with the traffic information of the multiple dataflows and the elephant-flow traffic threshold. For example, theclassification decision circuit 320 calculates the traffic of the firstdata flow according to the first traffic information of the first dataflow (e.g., dividing a packet number/byte number by a period of time,wherein the packet number/byte number is the first traffic informationobtained by means of the recording circuit 210 counting the packetnumber/byte number of the first data flow in the period of time), andthen determines whether the traffic of the first data flow is greaterthan the elephant-flow traffic threshold. On condition that the trafficof the first data flow is greater than the elephant-flow trafficthreshold, the classification decision circuit 320 classifies theclassification of the first data flow under an elephant flowclassification. On condition that the traffic of the first data flow isless than the elephant-flow traffic threshold, the classificationdecision circuit 320 classifies the classification of the first dataflow under a non-elephant flow classification.

FIG. 7 shows an exemplary implementation of how the classificationdecision circuit 320 determines the classification of the first dataflow, wherein the horizontal axis (Flow[i].Rate) is indicative of thetraffic of a data flow and each vertical arrow is indicative of one dataflow. As shown in FIG. 7, the elephant-flow traffic threshold is higherthan a first threshold (RED_MIN[i]) and thus the classification decisioncircuit 320 determines that the elephant flow classification is a firstclassification. Accordingly, on condition that the traffic of the firstdata flow is higher than the elephant-flow traffic threshold, theclassification decision circuit 320 classifies the first data flow underthe first classification (i.e., the classification of the two data flowson the right side of the elephant-flow traffic threshold ELE_TH in thefigure); and on condition that the traffic of the first data flow islower than the elephant-flow traffic threshold, the classificationdecision circuit 320 classifies the first data flow under thenon-elephant flow classification (i.e., the classification of the sevendata flows on the left side of the elephant-flow traffic thresholdELE_TH in the figure).

FIG. 8 shows another exemplary implementation of how the classificationdecision circuit 320 determines the classification of the first dataflow. As shown in FIG. 8, the elephant-flow traffic threshold is lowerthan the first threshold (RED_MIN[i]) but higher than a second threshold(YEL_MIN[i]), wherein the first threshold is higher than the secondthreshold. Accordingly, the elephant flow classification determined bythe classification decision circuit 320 includes a first classificationand a second classification. On condition that the traffic of the firstdata flow is higher than the first threshold (RED_MIN[i]), theclassification decision circuit 320 classifies the first data flow underthe first classification (i.e., the classification of the three dataflows on the right side of the first threshold RED_MIN[i] in thefigure); on condition that the traffic of the first data flow is lowerthan the first threshold (RED_MIN[i]) but higher than the elephant-flowtraffic threshold (ELE_TH), the classification decision circuit 320classifies the first data flow under the second classification (i.e.,the classification of the two data flows between the first thresholdRED_MIN[i] and the elephant-flow traffic threshold ELE_TH in thefigure); and on condition that the traffic of the first data flow islower than the elephant-flow traffic threshold (ELE_TH), theclassification decision circuit 320 classifies the first data flow underthe non-elephant flow classification (i.e., the classification of thefour data flows on the left side of the elephant-flow traffic thresholdELE_TH in the figure).

FIG. 9 shows yet another exemplary implementation of how theclassification decision circuit 320 determines the classification of thefirst data flow. As shown in FIG. 9, the elephant-flow traffic thresholdis lower than the second threshold (YEL_MIN[i]) and thus the elephantflow classification determined by the classification decision circuit320 includes a first classification and a second classification. Oncondition that the traffic of the first data flow is higher than thefirst threshold (RED_MIN[i]), the classification decision circuit 320classifies the first data flow under the first classification (i.e., theclassification of the three data flows on the right side of the firstthreshold RED_MIN[i] in the figure); on condition that the traffic ofthe first data flow is lower than the first threshold (RED_MIN[i]) buthigher than the second threshold (YEL_MIN[i]) and the elephant-flowtraffic threshold (ELE_TH), the classification decision circuit 320classifies the first data flow under the second classification (i.e.,the classification of the two data flows between the first thresholdRED_MIN[i] and the second threshold YEL_MIN[i] in the figure); and oncondition that the traffic of the first data flow is lower than thesecond threshold (YEL_MIN[i]), the classification decision circuit 320classifies the first data flow under the non-elephant flowclassification (i.e., the classification of the four data flows on theleft side of the second threshold YEL_MIN[i] in the figure) regardlessof whether the traffic of the first data flow is higher than theelephant-flow traffic threshold, which implies that when theelephant-flow traffic threshold is adjusted to be lower than the secondthreshold (YEL_MIN[i]), the second threshold takes the place of theelephant-flow traffic threshold as the threshold for determining whethera data flow is a non-elephant flow and any data flow having a trafficlower than the second threshold is classified under the non-elephantflow classification. It is noted that the setting of the first thresholdand/or the setting of the second threshold can be determined accordingto the demand for classifying data flows, and the first threshold and/orthe second threshold can be kept in the classification decision circuit320 or an external circuit (not shown in the figures) accessible to theclassification decision circuit 320.

In an exemplary implementation, the classification decision circuit 320further determines whether the first data flow belongs to a specificdata flow group (e.g., a peer to peer (P2P) data flow group) furtheraccording to the identification information of the multiple data flowsand the traffic information of the multiple data flows, wherein thespecific data flow group can be specified according to the demand forimplementation and normally includes a plurality of data flows. Forexample, the traffic information of the multiple data flows include thepacket length information and the packet interval information; if thetraffic information of the multiple data flows shows that the averagepacket length is greater than X bytes (e.g., 500 bytes) and/or theaverage packet interval time is shorter than Y millisecond (e.g., 1 ms),the classification decision circuit 320 determines that the first dataflow belongs to a P2P data flow group, wherein both the X and Y arenumbers greater than zero. It is noted that although the above decisionis made mainly according to the traffic statistics of data flows, theimplementation of the present invention is not limited thereto; forexample, the decision may be made according to the packet intervalvariance and/or other statistics. If the first data flow belongs to thespecific data flow group, the classification decision circuit 320determines the classification of the first data flow according to thetotal traffic of the specific data flow group (i.e., the sum of thetraffic of all data flows included in the specific data flow group) andthe elephant-flow traffic threshold; more specifically, even though thetraffic of the first data flow is lower than the elephant-flow trafficthreshold, if the total traffic of the specific data flow groupincluding the traffic of the first data flow is higher than theelephant-flow traffic threshold, the classification decision circuit 320determines that the first data flow is an elephant flow, which meansthat all data flows in the specific data flow group are elephant flows.

FIG. 10 shows another embodiment of the data flow classification deviceof the present disclosure. The data flow classification device 1000 ofFIG. 10 includes a forwarding circuit 1010 and a configuring circuit1020. Each of the forwarding circuit 1010 and the configuring circuit1020 can be realized with hardware or realized with hardware executingsoftware and/or firmware. In regard to the difference between theembodiment of FIG. 1 and the embodiment of FIG. 10, the forwardingcircuit 110 in FIG. 1 includes the function of acquiring the trafficinformation of a data flow (e.g., packet number/byte number) while theforwarding circuit 1010 in FIG. 10 has no need to include this function;and the configuring circuit 120 in FIG. 1 doesn't need to record thetraffic information of a data flow (e.g., the serial number of a packetand the reception time of this packet) while the configuring circuit1020 in FIG. 10 includes this recording function. In brief, theconfiguring circuit 120 in FIG. 1 is relatively simple while theforwarding circuit 1010 in FIG. 10 is relatively simple, so that thoseimplementing the present invention can choose the configuration of FIG.1 or FIG. 10 according to their demand. It is noted that people havingordinary skill in the art can appreciate the detail and modification ofthe embodiment of FIG. 10 according to the disclosure of the embodimentof FIG. 1, which means that the features of the embodiment of FIG. 1 canbe applied to the embodiment of FIG. 10 in a logical way; therefore, therepeated and redundant descriptions are omitted here.

FIG. 11 shows an embodiment of the forwarding circuit 1010 of FIG. 10.The forwarding circuit 1010 of FIG. 11 includes a first storage circuit1110, a classification circuit 1120, and a data flow informationacquiring circuit 1130. The first storage circuit 1110 and theclassification circuit 1120 may be integrated into one lookup tablecircuit (not shown in the figure), but the implementation of the presentinvention is not limited thereto.

Referring to FIGS. 10-11. The first storage circuit 1110 is configuredto store a lookup table 1112 which stores the identification informationof multiple data flows and the classifications of the multiple dataflows. In an exemplary implementation, the identification information ofeach of the multiple data flows is a set of values such as theaforementioned 5-tuple, but the implementation of the present inventionis not limited thereto. Providing an implementation of the presentinvention is practicable, any information that can be used as theidentification of a data flow can be the identification information inthis implementation.

Referring to FIGS. 10-11. The classification circuit 1120 is coupledwith a data flow input (i.e., the source of the arrow labeled with “dataflows” in the figures) and the first storage circuit 1110, andconfigured to receive a first data flow from the data flow input andsearch the identification information of the multiple data flows in thelookup table 1112 for the first identification information of the firstdata flow, wherein the first data flow can be any data flow receivedfrom the data flow input. The classification circuit 1120 may search theinformation in the lookup table 1112 in a way the same as (or similarto) the classification circuit 220 of FIG. 2 searching the informationin the lookup table 212. On condition that the first identificationinformation is included in the lookup table 1112, the classificationcircuit 1120 determines the classification of the first data flowaccording to the classifications of the multiple data flows stored inthe lookup table 1112, and then outputs the first data flow to a buffercircuit 11, and the classification circuit 1120 may determine theclassification of the first data flow in a way the same as (or similarto) the classification circuit 220 of FIG. 2 determining theclassification of the first data flow. On condition that the firstidentification information is not included in the lookup table 1112, theclassification circuit 1120 treats the classification of the first dataflow as a predetermined classification (e.g., non-elephant flowclassification), and then outputs the first data flow to the buffercircuit 11. It is noted that the buffer circuit 11 can be integratedinto the data flow classification device 1000 or independent of the dataflow classification device 1000.

In an exemplary implementation, the classifications of the multiple dataflows stored in the lookup table 1112 are the same as (or similar to)the classifications of the multiple data flows (i.e., the elephant flowclassification and the non-elephant flow classification included in theclassifications of the multiple data flows) stored in the lookup table212 of FIG. 2, and the buffer circuit 11 is the same as (or similar to)the buffer circuit 10 and is capable of assigning different transmissionpriorities or discard rates to data flows classified under differentclassifications. In an exemplary implementation, on condition that thefirst identification of the first data flow is included in the lookuptable 1112, the classification of the first data flow will be includedin the lookup table 1112 logically; accordingly, the classificationcircuit 1120 can tag each packet of the first data flow according to theclassification of the first data flow stored in the lookup table 1112,so that the buffer circuit 11 can learn of the classification of eachpacket according to its tag.

Referring to FIGS. 10-11. The data flow information acquiring circuit1130 is configured to acquire at least a part of the first data flowfrom the data flow input or the output of the classification circuit1120, so as to obtain and output the first identification of the firstdata flow (e.g., the aforementioned 5-tuple). It is noted that in thisembodiment, the data flow information acquiring circuit 1130 acquiresthe at least a part of the first data flow regardless of whether thelookup table 1112 includes the first identification information. In anexemplary implementation, the data flow information acquiring circuit1130 performs a sample operation according to a predeterminedprobability in order to obtain the at least a part of the first dataflow, and thereby obtains the first identification and trafficinformation of the first data flow; in other words, a probability of thedata flow information acquiring circuit 1130 obtaining the at least apart of the first data flow is equal to the predetermined probability.In light of the above, the data flow information acquiring circuit 1130may miss some packets of the first data flow.

FIG. 12 shows an embodiment of the configuring circuit 1020 of FIG. 10.The configuring circuit 1020 of FIG. 12 includes a second storagecircuit 1210, an elephant-flow traffic threshold adjustment circuit1220, and a classification decision circuit 1230.

Referring to FIGS. 10-12. The second storage circuit 1210 is coupled tothe data flow information acquiring circuit 1130, and configured tostore a data flow information table 1212 which stores the identificationand traffic information of the multiple data flows from the data flowinformation acquiring circuit 1130, in which the identificationinformation of the multiple data flows includes the first identificationinformation and the traffic information of the multiple data flowsincludes the first traffic information.

Referring to FIGS. 10-12. The elephant-flow traffic threshold adjustmentcircuit 1220 is coupled to the buffer circuit 11, and configured todetermine an elephant-flow traffic threshold according to the variationin a relation between a target queue state (e.g., constant queue lengthor constant queuing delay) and a current queue state (e.g., variablequeue length or variable queuing delay) of the buffer circuit 11. Anembodiment of the elephant-flow traffic threshold adjustment circuit1220 is the same as (or similar to) the elephant-flow traffic thresholdadjustment circuit 310 of FIG. 3, and the detail is found in FIG. 3-6and the description thereof.

Referring to FIGS. 10-12. The classification decision circuit 1230 iscoupled to the elephant-flow traffic threshold adjustment circuit 1220,the second storage circuit 1210, and the first storage circuit 1110. Theclassification decision circuit 1230 is configured to determine theclassifications of the multiple data flows stored in the lookup table1112 of the first storage circuit 1110 according to the variation in arelation between the traffic information of the multiple data flows andthe elephant-flow traffic threshold. For example, the classificationdecision circuit 1230 calculates the traffic of the first data flowaccording to the first traffic information of the first data flow storedin the data flow information table 1212, then determines theclassification of the first data flow according to the traffic of thefirst data flow and the elephant-flow traffic threshold, and accordinglyupdates the classification of the first data flow in the lookup table1112. The classification decision circuit 1230 determines theclassification of the first data flow in a way the same as (or similarto) the classification decision circuit 320 determining theclassification of the first data flow.

In an exemplary implementation, when a packet protocol of the first dataflow is Transmission Control Protocol (TCP), the data flow informationacquiring circuit 1130 performs a sample operation according to apredetermined probability so as to obtain two packets of the first dataflow including a previous packet and a current packet; afterward, theclassification decision circuit 1230 learns the traffic of the firstdata flow according to the serial numbers of the two packets and thetime points of sampling the two packets. For example, the serial numberof the previous packet (Pre_SN) and the time point of sampling theprevious packet (Pre_Time) are recorded and kept in the second storagecircuit 1210, the serial number of the current packet (Cur_SN) and thetime point of sampling the current packet (Cur_Time) are provided by thedata flow information acquiring circuit 1130 in realtime, and theclassification decision circuit 1230 divides the difference between thetwo serial numbers (deltaSN=Cur_SN−Pre_SN) by the time interval betweenthe time points of sampling the two packets(deltaTime=Cur_Time−Pre_Time) to obtain the traffic of the first dataflow (Flow[i].rate), which can be expressed with the following equation:

${{{Flow}\lbrack i\rbrack}.{rate}} = \frac{{delta}\;{SN}}{{delta}\;{Time}}$

It is noted that the serial number of the latest packet and the timepoint of sampling the latest packet provided by the data flowinformation acquiring circuit 1130 will be used to update (or replace)the serial number of the previous packet and the time point of samplingthe previous packet respectively.

In an exemplary implementation, when a packet protocol of the first dataflow is not TCP, the data flow information acquiring circuit 1130performs a sample operation according to a predetermined probability soas to obtain two packets of the first data flow including a previouspacket and a current packet; afterward, the classification decisioncircuit 1230 learns the traffic of the first data flow according to thelength of the current packet, the predetermined probability, and thetime points of sampling the two packets. For example, the time point ofsampling the previous packet (Pre_Time) is recorded and stored in thesecond storage circuit 1210, the time point of sampling the currentpacket (Cur_Time) and the length of the current packet (Cur_Length) areprovided by the data flow information acquiring circuit 1130 inrealtime, and the classification decision circuit 1230 divides thelength of the current packet by the predetermined probability (P %) toobtain a value and then divides the value by the interval between thetime points of sampling the two packets (deltaTime=Cur_Time−Pre_Time) toestimate the traffic of the first data flow (Flow[i].rate), which can beexpressed with the following equation:

${{{Flow}\lbrack i\rbrack}.{rate}} = \frac{\frac{Cur\_ Length}{P\%}}{{delta}\;{Time}}$

In an exemplary implementation, the classification decision circuit 1230can determine whether the first data flow belongs to a specific dataflow group (e.g., peer to peer (P2P) data flow group) according to theidentification information of the multiple data flows and the trafficinformation of the multiple data flows. The classification decisioncircuit 1230 can determine whether the first data flow belongs to aspecific data flow group in a way the same as (or similar to) thatapplied to the classification decision circuit 320.

It is noted that people of ordinary skill in the art can selectively usesome or all of the features of any embodiment in this specification orselectively use some or all of the features of multiple embodiments inthis specification to implement the present invention as long as suchimplementation is practicable; in other words, the present invention canbe implemented flexibly in accordance with the present disclosure.

To sum up, the data flow classification device of the present disclosurecan classify multiple data flows according to the comparison between thetraffic of the multiple data flows and an elephant-flow trafficthreshold, and can prevent the problems of the prior art.

The aforementioned descriptions represent merely the preferredembodiments of the present invention, without any intention to limit thescope of the present invention thereto. Various equivalent changes,alterations, or modifications based on the claims of the presentinvention are all consequently viewed as being embraced by the scope ofthe present invention.

What is claimed is:
 1. A data flow classification device, comprising: aforwarding circuit including: a first storage circuit configured tostore a lookup table which stores identification information of multipledata flows and classifications of the multiple data flows; aclassification circuit coupled with a data flow input and the firststorage circuit, the classification circuit configured to receive afirst data flow from the data flow input and search the identificationinformation of the multiple data flows in the lookup table for firstidentification information of the first data flow, on condition that thefirst identification information is included in the lookup table, theclassification circuit determining classification of the first data flowaccording to the classifications of the multiple data flows included inthe lookup table and outputting the first data flow to a buffer circuit,and on condition that the first identification information is notincluded in the lookup table, the classification circuit treating theclassification of the first data flow as a predetermined classificationand outputting the first data flow to the buffer circuit; and a dataflow information acquiring circuit configured to acquire at least a partof the first data flow to obtain the first identification informationand first traffic information of the first data flow; and a configuringcircuit including: a second storage circuit coupled to the data flowinformation acquiring circuit, the second storage circuit configured tostore a data flow information table which stores the identificationinformation of the multiple data flows and traffic information of themultiple data flows, in which the identification information of themultiple data flows includes the first identification information andthe traffic information of the multiple data flows includes the firsttraffic information; an elephant-flow traffic threshold adjustmentcircuit coupled to the buffer circuit, the elephant-flow trafficthreshold adjustment circuit configured to determine an elephant-flowtraffic threshold according to a variation in a relation between atarget queue state and a current queue state of the buffer circuit; anda classification decision circuit coupled to the elephant-flow trafficthreshold adjustment circuit, the second storage circuit, and the firststorage circuit, the classification decision circuit configured todetermine the classifications of the multiple data flows stored in thelookup table of the first storage circuit according to a variation in arelation between the traffic information of the multiple data flows andthe elephant-flow traffic threshold.
 2. The data flow classificationdevice of claim 1, wherein the identification information of each of themultiple data flows includes: a destination Internet Protocol (IP)address; a source IP address; a protocol; a destination port; and asource port.
 3. The data flow classification device of claim 1, whereineach packet of the first data flow includes the first identificationinformation; the classification circuit is configured to search theidentification information of the multiple data flows in the lookuptable for the first identification information; and on condition thatthe first identification information is included in the lookup table,the classification of the first data flow relevant to the firstidentification information is included in the lookup table, and thus theclassification circuit tags each packet of the first data flow with theclassification of the first data flow stored in the lookup table.
 4. Thedata flow classification device of claim 1, wherein the target queuestate and the current queue state are indicative of a target queuelength and a current queue length respectively, or the target queuestate and the current queue state are indicative of a target queuequeuing delay and a current queue queuing delay respectively.
 5. Thedata flow classification device of claim 1, wherein the classificationsof the multiple data flow stored in the lookup table include an elephantflow classification and a non-elephant flow classification; a traffic ofany data flow classified under the elephant flow classification ishigher than a traffic of any data flow classified under the non-elephantflow classification; an elephant flow transmission priority assigned tothe elephant flow classification is lower than a non-elephant flowtransmission priority assigned to the non-elephant flow classification,or an elephant flow packet discard rate in connection with the elephantflow classification is higher than a non-elephant flow packet discardrate in connection with the non-elephant flow classification; and thepredetermined classification is the non-elephant flow classification. 6.The data flow classification device of claim 5, wherein the elephantflow classification includes a first classification and a secondclassification; a traffic of any data flow classified under the firstclassification is higher than a traffic of any data flow classifiedunder the second classification; and a first transmission priorityassigned to the first classification is lower than a second transmissionpriority assigned to the second classification, or a first packetdiscard rate in connection with the first classification is higher thana second packet discard rate in connection with the secondclassification.
 7. The data flow classification device of claim 1,wherein the data flow information acquiring circuit performs a sampleoperation according to a predetermined probability to obtain the atleast a part of the first data flow, and thereby obtains the firstidentification information and the first traffic information.
 8. Thedata flow classification device of claim 1, wherein after the currentqueue state is superior to the target queue state N time(s), theelephant-flow traffic threshold adjustment circuit determines that thebuffer circuit is in a congestion state, and lower the elephant-flowtraffic threshold at least one time; and the N is a positive integer. 9.The data flow classification device of claim 8, wherein a queue state ofthe buffer circuit at a current time point is the current queue state;the queue state of the buffer circuit at a previous time point is aprevious queue state; the queue state of the buffer circuit is a queuelength or a queuing delay; in a circumstance that the buffer circuit isin the congestion state, when the current queue state is superior to thetarget queue state, the elephant-flow traffic threshold adjustmentcircuit lowers the elephant-flow traffic threshold further according toa variation in a relation between the current queue state and theprevious queue state.
 10. The data flow classification device of claim9, wherein in the circumstance that the buffer circuit is in thecongestion state, when the current queue state is superior to each ofthe target queue state and the previous queue state, the elephant-flowtraffic threshold adjustment circuit lowers the elephant-flow trafficthreshold by a first degree, when the current queue state is superior tothe target queue state but inferior to the previous queue state, theelephant-flow traffic threshold adjustment circuit lowers theelephant-flow traffic threshold by a second degree; and the first degreeis greater than the second degree.
 11. The data flow classificationdevice of claim 8, wherein a queue state of the buffer circuit at acurrent time point is the current queue state; the queue state of thebuffer circuit at a previous time point is a previous queue state; thequeue state of the buffer circuit is a queue length or a queuing delay;in a circumstance that the buffer circuit is in the congestion state,when the current queue state is inferior to the target queue state, theelephant-flow traffic threshold adjustment circuit lowers or maintainsthe elephant-flow traffic threshold further according to a variation ina relation between the current queue state and the previous queue state.12. The data flow classification device of claim 11, wherein in thecircumstance that the buffer circuit is in the congestion state, whenthe current queue state is inferior to the target queue state butsuperior to the previous queue state, the elephant-flow trafficthreshold adjustment circuit lowers the elephant-flow traffic threshold,and when the current queue state is inferior to each of the target queuestate and the previous queue state, the elephant-flow traffic thresholdadjustment circuit maintains the elephant-flow traffic threshold. 13.The data flow classification device of claim 8, wherein after thecurrent queue state is inferior to one-K^(th) of the target queue stateM time(s), the elephant-flow traffic threshold adjustment circuitdetermines that the buffer circuit is in a non-congestion state, andraises the elephant-flow traffic threshold at least one time; and boththe K and the M are positive integers.
 14. The data flow classificationdevice of claim 8, wherein the buffer circuit includes a non-elephantflow buffer queue and at least one elephant flow buffer queue; thecurrent queue state is a queue state of the non-elephant flow bufferqueue; a non-elephant flow transmission priority assigned to thenon-elephant flow buffer queue is higher than any elephant flowtransmission priority assigned to the at least one elephant flow bufferqueue, or a non-elephant flow packet discard rate in connection with thenon-elephant flow buffer queue is lower than any elephant flow packetdiscard rate in connection with the at least one elephant flow bufferqueue; after each elephant-flow current queue state of the least oneelephant flow buffer queue is inferior to one-K^(th) of the target queuestate M time(s), the elephant-flow traffic threshold adjustment circuitdetermines that the buffer circuit is in a non-congestion state, andraises the elephant-flow traffic threshold at least one time; and boththe K and the M are positive integers.
 15. The data flow classificationdevice of claim 1, wherein on condition that the classification decisioncircuit determines that traffic of the first data flow is higher thanthe elephant-flow traffic threshold according to the first trafficinformation, the classification decision circuit determines that theclassification of the first data flow is an elephant flowclassification; and on condition that the classification decisioncircuit determines that the traffic of the first data flow is lower thanthe elephant-flow traffic threshold according to the first trafficinformation, the classification decision circuit determines that theclassification of the first data flow is a non-elephant flowclassification.
 16. The data flow classification device of claim 15,wherein when the elephant-flow traffic threshold is higher than a firstthreshold, the elephant flow classification is a first classification;when the elephant-flow traffic threshold is lower than the firstthreshold but higher than a second threshold, the elephant flowclassification includes the first classification and a secondclassification; when the elephant-flow traffic threshold is between thefirst threshold and the second threshold, if the classification decisioncircuit determines that the traffic of the first data flow is higherthan the first threshold, the classification decision circuit determinesthat the classification of the first data flow is the firstclassification; when the elephant-flow traffic threshold is between thefirst threshold and the second threshold, if the classification decisioncircuit determines that the traffic of the first data flow is lower thanthe first threshold but higher than the elephant-flow traffic threshold,the classification decision circuit determines that the classificationof the first data flow is the second classification; and when theelephant-flow traffic threshold is between the first threshold and thesecond threshold, if the classification decision circuit determines thatthe traffic of the first data flow is lower than the elephant-flowtraffic threshold, the classification decision circuit determines thatthe classification of the first data flow is the non-elephant flowclassification.
 17. The data flow classification device of claim 15,wherein the data flow information acquiring circuit performs a sampleoperation according to a predetermined probability to obtain two packetsof the first data flow; when a packet transmission protocol of the firstdata flow is Transmission Control Protocol (TCP), the classificationdecision circuit determines the traffic of the first data flow accordingto serial numbers of the two packets and time points of sampling the twopackets.
 18. The data flow classification device of claim 15, whereinthe data flow information acquiring circuit performs a sample operationaccording to a predetermined probability to obtain two packets of thefirst data flow including a previous packet and a current packet; when apacket transmission protocol of the first data flow is not TransmissionControl Protocol (TCP), the classification decision circuit determinesthe traffic of the first data flow according to a packet length of thecurrent packet, the predetermined probability, and time points ofsampling the two packets.
 19. The data flow classification device ofclaim 1, wherein the classification decision circuit is configured todetermine whether the first data flow belongs to a specific data flowgroup according to the identification information of the multiple dataflows and the traffic information of the multiple data flows; and whenthe first data flow belongs to the specific data flow group, theclassification decision circuit determines the classification of thefirst data flow according to a total traffic of the specific data flowgroup and the elephant-flow traffic threshold.
 20. The data flowclassification device of claim 19, wherein the traffic information ofthe multiple data flows includes packet length information and packetinterval information.